LEAST-SQUARE HALFTONING VIA HUMAN VISION SYSTEM AND MARKOV GRADIENT DESCENT (LS-MGD): ALGORITHM AND ANALYSIS By
نویسنده
چکیده
Halftoning is the core algorithm governing most digital printing or imaging devices, by which images of continuous tones are converted to ensembles of discrete or quantum dots. It is through the human vision system (HVS) that such fields of quantum dots can be perceived almost identical to the original continuous images. In the current work, we propose a leastsquare based halftoning model with a substantial contribution from the HVS model, and design a robust computational algorithm based on Markov random walks. Furthermore, we discuss and quantify the important role of spatial mixing by the HVS, and rigorously prove the gradientdescent property of the Markov-stochastic algorithm. Computational results on typical test images further confirm the performance of the new approach. The proposed algorithm and its mathematical analysis are generically applicable to the discrete or nonlinear programming for similar tasks.
منابع مشابه
Least-square Halftoning via Human Vision System and Markov Gradient Descent (ls-mgd): Algorithm and Analysis
Halftoning is the core algorithm governing most digital printing or imaging devices, by which images of continuous tones are converted to ensembles of discrete or quantum dots. It is through the human vision system (HVS) that such fields of quantum dots can be perceived almost identical to the original continuous images. In the current work, we propose a least-square based halftoning model with...
متن کاملLeast-Squares Halftoning via Human Vision System and Markov Gradient Descent (LS-MGD): Algorithm and Analysis
Halftoning is the core algorithm governing most digital printing or imaging devices, by which images of continuous tones are converted to ensembles of discrete or quantum dots. It is through the human vision system (HVS) that such fields of quantum dots can be perceived almost identical to the original continuous images. In the current work, we propose a least-square based halftoning model with...
متن کاملA Weighted Mirror Descent Algorithm for Nonsmooth Convex Optimization Problem
Large scale nonsmooth convex optimization is a common problem for a range of computational areas including machine learning and computer vision. Problems in these areas contain special domain structures and characteristics. Special treatment of such problem domains, exploiting their structures, can significantly improve the computational burden. We present a weighted Mirror Descent method to so...
متن کاملA system for voice conversion based on adaptive filtering and line spectral frequency distance optimization for text-to-speech synthesis
This paper proposes a new voice conversion algorithm that modifies the source speaker’s speech to sound as if produced by a target speaker. To date, most approaches for speaker transformation are based on mapping functions or codebooks. We propose a linear filtering based approach to the problem of mapping the spectral parameters of one speaker to those of the other. In the proposed method, the...
متن کاملFace Orientation Estimation in Smart Camera Networks
An important motivation for face orientation analysis derives from the fact that most face recognition algorithms require face images with approximately frontal view to operate efficiently, such as principle component analysis (PCA) [6], linear discriminant analysis (LDA) [4], and hidden markov model (HMM) techniques [2]. In a networked camera setting, the desire for a fontal view to pursue an ...
متن کامل